Set of Points on Elliptic Curve in Projective Coordinates
نویسندگان
چکیده
For simplicity, we use the following convention: x is a set, i, j are integers, n, n1, n2 are natural numbers, and K, K1, K2 are fields. Let K be a field. A field is called a subfield of K if it satisfies the conditions (Def. 1). (Def. 1)(i) The carrier of it ⊆ the carrier of K, (ii) the addition of it = (the addition of K) (the carrier of it), (iii) the multiplication of it = (the multiplication of K) (the carrier of it), (iv) 1it = 1K , and (v) 0it = 0K . We now state two propositions:
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملSymbolic computation of Error Control Codes on the Elliptic Riemann Surface
In this paper we make use of the power series facility of Scratchpad2 , a symbolic computer language under development at the IBM Research Mathematics Department , to construct algebraic ECC on the elliptic Riemann surface of genus one. The construction method described uses products of elliptic theta series with rational characteristics and finite field coefficients to define the projective co...
متن کاملA fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinates
A new fast addition algorithm on an elliptic curve over GF(2n) using the projective coordinates with x =X/Z and y = Y/Z2 is proposed. 2000 Elsevier Science B.V. All rights reserved.
متن کاملOn the Use of Optimum Curves in Elliptic Curve Cryptography for Wireless Sensor Networks
Providing security in Wireless Sensor Networks (WSNs) is a considerable challenge due to the concomitant limitations in processing time, power, area and energy consumption in sensor nodes and the nature of wireless links. A variety of cryptographic methods are available for security establishment. Among them, Elliptic Curve Cryptography (ECC) is the best candidate to accomplish this challenge b...
متن کاملSchoof’s Algorithm for Counting Points on E(Fq)
This is commonly known as Weierstraß form. To be rigorous, we would have to introduce projective coordinates to define the entire zero locus. However, in the case of an elliptic curve, the zero locus includes all the points (x, y) satisfying equation (1), these are known as affine points, plus exactly one additional point P∞ “at infinity”. While there is also an extensive theory of elliptic cur...
متن کاملOn the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
We consider a quantum polynomial-time algorithm which solves the discrete logarithm problem for points on elliptic curves over GF (2m). We improve over earlier algorithms by constructing an efficient circuit for multiplying elements of binary finite fields and by representing elliptic curve points using a technique based on projective coordinates. The depth of our proposed implementation is O(m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formalized Mathematics
دوره 19 شماره
صفحات -
تاریخ انتشار 2011